منابع مشابه
Deterministic Gathering with Crash Faults
A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, have to meet at the same node and terminate. This problem is known as gathering. We study deterministic gathering algorithms under the assumption that agents are subject to crash faults which can occur at any time. Two fault scenarios are considered. A motion fault immobilizes the agent...
متن کاملSelf-stabilizing Deterministic Gathering
In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, and oblivious). We introduce strong multiplicity detection as the ability for the robots to detect the exact number of robots located at a given position. We show that with strong multiplicity detection, there exists a determini...
متن کاملGathering of Robots in a Ring with Mobile Faults
In this paper, we consider the problem of gathering mobile agents in a graph in the presence of mobile faults that can appear anywhere in the graph. Faults are modeled as a malicious mobile agent that attempts to block the path of the honest agents and prevents them from gathering. The problem has been previously studied by a subset of the authors for asynchronous agents in the ring and in the ...
متن کاملCrash faults identification in wireless sensor networks
In this paper we consider the problem of identifying faulty (crashed) nodes in a wireless sensor network. This problem is of fundamental importance in those applicative scenarios of wireless sensor networks in which battery replacement is feasible. The diagnostic information gathered by operational sensors can be used by an external operator for the sake of network reconfiguration and/or repair...
متن کاملDeterministic Models of Communication Faults
In this paper we survey some results concerning the impact of faulty environments on the solvability and complexity of communication tasks. In particular, we focus on deterministic models of faults in synchronous networks, and show how different variations of the model influence the performance bounds of broadcasting algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2018
ISSN: 0028-3045
DOI: 10.1002/net.21810